The barycenters of the k-additive dominating belief functions & the pignistic k-additive belief functions
نویسندگان
چکیده
In this paper, we consider the dominance properties of the set of the pignistic k-additive belief functions. Then, given k, we conjecture the shape of the polytope of all the k-additive belief functions dominating a given belief function, starting from an analogy with the case of dominating probability measures. Under such conjecture, we compute the analytical form of the barycenter of the polytope of k-additive dominating belief functions, and we study the location of the pignistic k-additive belief functions with respect to this polytope and its barycenter.
منابع مشابه
Two k-additive generalizations of the pignistic transform for imprecise decision making
The Transferable Belief approach to the Theory of Evidence is based on the pignistic transform which, mapping belief functions to probability distributions, allows to make “precise” decisions on a set of disjoint hypotheses via classical utility theory. In certain scenarios, however, such as medical diagnosis, the need for an “imprecise” approach to decision making arises, in which sets of poss...
متن کاملDominance of capacities by k - additive belief functions ∗
In this paper we deal with the set of k-additive belief functions dominating a given capacity. We follow the line introduced by Chateauneuf and Jaffray for dominating probabilities and continued by Grabisch for general k-additive measures. First, we show that the conditions for the general k-additive case lead to a very wide class of functions and this makes that the properties obtained for pro...
متن کاملOn the k-additive Core of Capacities
We investigate in this paper the set of kadditive capacities dominating a given capacity, which we call the k-additive core. We study its structure through achievable families, which play the role of maximal chains in the classical case (k = 1), and show that associated capacities are elements (possibly a vertex) of the k-additive core when the capacity is (k+1)-monotone. As a particular case, ...
متن کاملFinding the Set of k-additive Dominating Measures Viewed as a Flow Problem
In this paper we deal with the problem of obtaining the set of k-additive measures dominating a fuzzy measure. This problem extends the problem of deriving the set of probabilities dominating a fuzzy measure, an important problem appearing in Decision Making and Game Theory. The solution proposed in the paper follows the line developed by Chateauneuf and Jaffray for dominating probabilities and...
متن کاملGeometry of the set of dominating k-additive belief functions
In this paper we introduce a novel, simpler form of the polytope of inner Bayesian approximations of a belief function, or “consistent probabilities”. We prove that the set of vertices of this polytope is generated by all possible permutations of elements of the domain, mirroring a similar behavior of outer consonant approximations. An intriguing connection with the behavior of maximal outer co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010